Modified ElGamal over RSA Digital Signature Algorithm (MERDSA)
نویسنده
چکیده
Generally digital signature algorithms are based on a single hard problem like prime factorization problem, discrete logarithm problem, elliptic curve problem. If one finds solution of this single hard problem then these digital signature algorithms will no longer be secured and due to large computational power, this may be possible in future. There are many other algorithms which are based on the hybrid combination of prime factorization and discrete logarithms problem but different weaknesses and attacks have been developed against those algorithms. This paper also presents a new variant of digital signature algorithm which is based on two hard problems, prime factorization and discrete logarithm. KEYWORD-Digital Signature; Discrete logarithm; Factorization; Cryptanalysis
منابع مشابه
A Cryptographic Study of Some Digital Signature Schemes
RSA Cryptosystem ElGamal Cryptosystem Messey Omura Cryptosystem Knapsack Cryptosystem Construction of Knapsack Cryptosystem Quadratic Residue Cryptosystem Hybrid Cryptosystem: Diffie Hellman’s key Exchange Digital Signatures A Classification of Digital Signature Schemes Digital Signature Schemes with Appendix Digital Signature Schemes with Message Recovery RSA Signature Scheme Feige– Fiat – Sha...
متن کاملReview of ElGamal DSS RSA Elliptic Curves
We began the course with a discussion and review of private key cryptography and then started moving into the realm of public key cryptography. During this lecture, we will discuss four public key schemes. Even though RSA preceded the other schemes presented here, we will review ElGamal and introduce DSS rst (both mod p schemes), in hopes of providing more background and motivation for some of ...
متن کاملInformation Security on Elliptic Curves
The aim of this paper is to provide an overview for the research that has been done so far on elliptic curves cryptography role in information security area. The elliptic curves cryptosystem is the newest public-key cryptographic system and represents a mathematically richer procedure then the traditional cryptosystem based on public-key, like RSA, Diffie-Hellman, ElGamal and Digital Signature ...
متن کاملPublic Key Cryptography with a Group of Unknown Order
We present algorithms for digital signature generation and verification using public key cryptography over an arbitrary group G. The algorithms are similar to those of ElGamal, but do not require a knowledge of the group order. Forging signatures or determining the secret key requires the solution of a discrete logarithm problem over G, or the solution of other problems which appear at least as...
متن کاملBiometric Digital Signature Key Generation and Cryptography Communication Based on Fingerprint
A digital signature is a term used to describe a data string which associates a digital message with an assigned person only. Therefore, the main goal (or contribution) of this work is to study a simple method for generating digital signatures and cryptography communication using biometrics. The digital signature should be generated in the way that it can be verified by the existing cryptograph...
متن کامل